Flexible parsing
1980pp. 97–97
Citations Over TimeTop 1% of 1980 papers
Abstract
When people use natural language in natural settings, they often use it ungrammatically, missing out or repeating words, breaking-off and restarting, speaking in fragments, etc., Their human listeners are usually able to cope with these deviations with little difficulty. If a computer system wishes to accept natural language input from its users on a routine basis, it must display a similar indifference. In this paper, we outline a set of parsing flexibilities that such a system should provide. We go on to describe FlexP. a bottom-up pattern-matching parser that we have designed and implemented to provide these flexibilities for restricted natural language input to a limited-domain computer system.
Related Papers
- Flexible parsing(1981)
- → Flexible parsing(1980)31 cited
- → Real-Time Traffic Flow Pattern Matching to Improve Predictive Performance of Online Simulation-Based Dynamic Traffic Assignment(2019)2 cited
- → Linear Approximate Pattern Matching Algorithm(2021)
- → Linear indexing for all strings under all internal nodes in suffix trees(2021)