Linguistics Stack Exchange
Linguistics Stack Exchange

Questions tagged [parsing]

The process of syntactic analysis, usually used in the context of computational linguistics.

91 questions
10
votes
2 answers

How is the F1 score computed when assessing dependency parsing?

For example http://naacl2013.naacl.org/Documents/deep-learning-for-nlp-naacl-2013-tutorial.pdf says "+1.4% F1 Dependency Parsing". How is the F1 score computed when comparing dependency-based parse trees? (I know how to compute the F1 score when I…
user48665
  • 743
  • 1
  • 7
  • 16
4
votes
1 answer

What is the maximum accuracy that can achieve a projective dependency parser in English?

From what I understand: a projective dependency parsers can only output projective tree Wikipedia says: "a large majority of sentences in most languages are projective, i.e. they do not contain discontinuities. Only about 15-25% of actual sentences…
user48665
  • 743
  • 1
  • 7
  • 16
3
votes
1 answer

What are the major sources of error for state-of-the-art parsers?

I'm especially interested in parsing sentences written in English (dependency or constituency). Ideally I'd like to have an estimation of how much improvement solving each of those major sources of errors would result in.
Franck Dernoncourt
  • 1,588
  • 2
  • 12
  • 35
3
votes
0 answers

Are there any computer systems that can suggest the next word in a sentence based on grammatical correctness?

I know Apple and Google have predictive text, but I believe it is purely statistically generated, without analysis of a sentence's grammar. I know various computer parsing systems of human language exist…
julkarham
  • 179
  • 2
2
votes
1 answer

What's the difference between discontinuity and discontinuous dependencies?

I am reading the Wikpedia page on discontinuities, it says: Worth noting is that a large majority of sentences in most languages are projective, i.e. they do not contain discontinuities. Only about 15-25% of actual sentences contain a…
user48665
  • 743
  • 1
  • 7
  • 16
2
votes
0 answers

Do constituency parsers always generate POS tags?

For example, Cer, Daniel M., et al. "Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy." LREC. 2010. : All 5 presented constituency parsers generate POS tags. Do constituency parsers always generate POS tags?
user48665
  • 743
  • 1
  • 7
  • 16
2
votes
2 answers

How to derive training data for maltparser classifier from conll file

Could anyone explain how does the maltparser convert the dependency trees from a CONLL file to a series of transitions in order to train its classifier ?
ryuzakinho
  • 201
  • 1
  • 7
1
vote
2 answers

Parsing sentences

A layman's question: Given a sentence whose meaning is unique, is there any standard algorithm to uniquely determine/describe its grammatical structure such that it can be classified in a standard way (i.e. like, if I don't err, what exists in…
Mok-Kong Shen
  • 177
  • 4
1
vote
2 answers

Parsing a simple sentence?

I am doing natural language processing and I am trying to figure out how to parse the following sentence (I am using BNC tags to mark parts of speech): Have I seen the man? As far as I see it is like: Have > VHB I > PNP seen > VVN …
mzm
  • 15
  • 2
1
vote
0 answers

English ditransitive verb phares in CKY algorithm

I was pondering about English ditransitive verb phrases. Say we have the following: Sofia the candle. I can assume the phrase structure VP -> V NP NP, which is not a binary production. Any clue, how can we parse this ditransitive with the CKY…
user102859
  • 143
  • 3