Approximating Context-Free Grammars with a Finite-State Calculus

@inproceedings{GrimleyEvans1997ApproximatingCG,
  title={Approximating Context-Free Grammars with a Finite-State Calculus},
  author={Edmund Grimley-Evans},
  booktitle={ACL},
  year={1997}
}
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least context-free complexity, for applications such as speech processing in which speed is important finite-state models are often preferred. These requirements may be reconciled by using the more complex grammar to automatically derive a finite-state approximation which can then be used as a filter to guide speech recognition or to reject many hypotheses at an early stage of processing. A… Expand
18 Citations
Compounding and Derivational Morphology in a Finite-State Setting
Treatment of e-Moves in Subset Construction
  • G. van Noord
  • Workshop On Finite State Methods In Natural Language Processing
  • 1998
Treatment of Epsilon Moves in Subset Construction
Compiling contextual restrictions on strings into finite-state automata
Dependency Parsing with an Extended Finite-State Approach
...
1
2
...

References

SHOWING 1-10 OF 21 REFERENCES
The Recognition Capacity Of Local Syntactic Constraints
Regular Models of Phonological Rule Systems
Implementing and using finite automata toolkits
Parallel Replacement in Finite State Calculus
Andé
  • and Lauri Karttunen.
  • 1996
Efficient Finite-State Approximation of Context Free Grammars
  • Proceedings of ECAI 96
  • 1996
...
1
2
3
...