Efficient and Robust Parsing of Word Hypotheses Graphs
Authors:
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 280-295
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- TDL1994
- Quasi-destructive graph unification1991
- Feature logic with disjunctive unification1990
- Strategic lazy incremental copy graph unification1990
- Efficient implementation of lattice operationsACM Transactions on Programming Languages and Systems, 1989
- Using restriction to extend parsing algorithms for complex-feature-based formalisms1985