A Fundamental Algorithm for Dependency Parsing ( with corrections )

@inproceedings{Michael2010AFA,
  title={A Fundamental Algorithm for Dependency Parsing ( with corrections )},
  author={A. Michael},
  year={2010}
}
This paper presents a fundamental algorithm for parsing natural language sentences into dependency trees. Unlike phrase-structure (constituency) parsers, this algorithm operates one word at a time, attaching each word as soon as it can be attached, corresponding to properties claimed for the parser in the human brain. Like phrasestructure parsing, its worst-case complexity is O(n), but in human language, the worst case occurs only for small n. 
2 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Parsing discontinuous constituents with dependency grammar. Computational Linguistics 16:234–236

  • Covington, A Michael
  • 1990
Highly Influential
5 Excerpts

A computational model of human parsing

  • Abney, P Steven
  • Journal of Psycholinguistic Research
  • 1989
Highly Influential
6 Excerpts

Dependency-based formal description of language

  • Sgall, Peter
  • In The Encyclopedia of Language and Linguistics…
  • 1994
1 Excerpt

Dependency Parsing. Thesis, Ph.D., University of London

  • Fraser, M Norman
  • 1993
3 Excerpts

Computational Complexity and Natural Language

  • Barton, G. Edward, Robert C. Berwick, Eric Sven Ristad
  • 1987
3 Excerpts

Dependency theory: a formalism and some observations. Language

  • Hays, G David
  • 1964
3 Excerpts

Studies in Machine Translation – 10: Russian Sentence- Structure Determination

  • Hays, G D, T. W. Ziehe
  • Research Memorandum RM-2538,
  • 1960
2 Excerpts

Similar Papers

Loading similar papers…