Parsing natural language idioms with bidirectional finite-state machines
From MaRDI portal
Publication:5958729
DOI10.1016/S0304-3975(00)00300-5zbMath0984.68100MaRDI QIDQ5958729
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
This page was built for publication: Parsing natural language idioms with bidirectional finite-state machines