Skip to main content

Questions tagged [parsing]

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

23 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
5 votes
1 answer
149 views

What features are good for dependency parsing?

I am trying to implement a graph based dependency parser. Since I come from a computer engineering perspective, I have trouble finding the features. Assuming that we have a (head,dependent) relation ...
Tokugava's user avatar
3 votes
0 answers
134 views

How can I calculate the morphological similarity between sentences?

For my bachelor thesis i am probing various text similarity metrics for how much they incorporate different aspects of sentences. To get those aspects I use datasets that are annotated for semantic ...
MTD's user avatar
  • 31
3 votes
0 answers
32 views

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 ...
julkarham's user avatar
  • 179
3 votes
0 answers
59 views

Connections between combinatory categorial grammars and abstract categorial grammars?

Are there connections/translation or common tools usage/adaptation between combinatory (concrete) categorial grammars (incl. Lambek calculus) and abstract categorial grammars? Can tools for one of ...
TomR's user avatar
  • 499
3 votes
0 answers
57 views

How should "at some time" be tagged in Universal Dependencies framework?

I want to tag a sentence Jones was unemployed at some time before he graduated. with UD tags. I'm not sure how to tag at some time. Stanford parser suggests the reading: case (time-6, at-4) det (...
tadek's user avatar
  • 31
3 votes
0 answers
213 views

Inside-outside algorithm (PCFG learning) and binarization

I am implementing the Inside-outside algorithm to estimate the parameters of a PCFG based on the train corpus. One observation (on existing implementations) is that, the grammar is converted into ...
mushin's user avatar
  • 31
2 votes
0 answers
96 views

Problem Parsing a Sentence

I am having trouble parsing a sentence that I read in Douglas Biber, Susan Conrad, Geoffrey Leech's Longman Student Grammar of Spoken and Written English (2002). The sentence is: He was surprised to ...
Anna77's user avatar
  • 21
2 votes
0 answers
192 views

Struggling With Split Projections In My X Bar Tree Diagram

I am trying to complete this linguistics question but I am a bit stuck. I'm not sure if I'm using the AgrNomO projections correctly. I have attached the tree diagram, and here is the question: Draw ...
hooper's user avatar
  • 21
2 votes
0 answers
38 views

Any good, up-to-date advanced textbooks/handbooks in statistical parsing?

I was wondering if there are any good, up-to-date advanced textbooks in parsing, after having finished the preliminary treatments in Jurafsky & Martin and Manning & Schütze. Either ...
WavesWashSands's user avatar
2 votes
0 answers
31 views

Estimating the size of training data for grammer extraction

I have a dependency treebank including 100 sentences, which I divide into a training set and a test set. I extract some rules ((DS,PS) pairs) to convert the treebank to phrase structures. When I ...
Ahmad's user avatar
  • 173
2 votes
0 answers
524 views

Small English parser written in Java

I need an English parser written in Java with a small memory/processing input. I have used the Stanford parser, but it is rather heavy. I am also considering using the link grammar parser, which is ...
Nate Glenn's user avatar
1 vote
0 answers
33 views

Which syntactic dependency parsers perform best on search query phrases?

Lots of NLP libraries contain syntactic dependencies parsers (e.g. spaCy, NLTK, Stanford NLP, Spark NLP...). As I understand it (please correct me if I'm wrong), these are mostly designed to parse ...
TKR's user avatar
  • 10.9k
1 vote
0 answers
25 views

Why should we assign the head to a word as early as possible in shift-reduce dependency parsing?

This is about dependency parsing. The operation set of a shift-reduce parser was changed so that an arc is added as early as possible. It's claimed that "the longer a word has to wait to get assigned ...
Yan Yang's user avatar
  • 111
1 vote
0 answers
34 views

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 ...
user102859's user avatar
1 vote
0 answers
232 views

How to build a neural network dependency parser with a dynamic oracle?

I'm curruntly trying to improve the results of my dependency parser (arc-standard) when I found this article: that uses a dynamic oracle. https://www.aclweb.org/anthology/Q/Q13/Q13-1033.pdf The ...
HatemB's user avatar
  • 133
1 vote
0 answers
48 views

What tokenization scheme was used for the conll-X arabic corpus?

I wanted to know what tokenization scheme was used to tokenize the conll-X arabic corpus which was used for the 2006 shared task on dependency parsing ?
ryuzakinho's user avatar
1 vote
0 answers
283 views

Average number of independent clauses in a compound sentence

I'm working on a NLP project, where we analyze large text samples (think a novel), and produce some metrics that help us answer interesting questions about the text. One of these metrics is average ...
RuslanD's user avatar
  • 163
1 vote
0 answers
206 views

Methods to dissect or parse long, difficult sentences

TL;DR: Only English and French can I manage and so ask for. Instead of repeating 'long, difficult' hereafter, denote it mazy. Mazy sentences still stifle my reading comprehension; so I was gladdened ...
user avatar
1 vote
0 answers
363 views

How do PCFG parsers actually work?

I'm new to NLP. I have a few doubts about PCFG parser (NLTK). My understanding is that PCFG parser will return most probable parse tree. So if I'm parsing one sentence with PCFG parser, I'll be ...
m-bhole's user avatar
  • 111
0 votes
0 answers
126 views

How do languages with head-marking possessive phrases parse noun phrases?

I'm sick of not being able to find info any any grammatical feature I look up that isn't found in an SAE language. Anyway, looking up this feature, I have a hard time imaging how languages can keep ...
user avatar
0 votes
0 answers
27 views

Other name for "Predeterminer"/"Noun Premodifier" Dependency Relation?

I'm reading a paper which makes use of word dependency relationships from the Stanford Dependencies (SD) list. One such relation they refer to as "Predeterminer" and "Noun Premodifer&...
jon_simon's user avatar
  • 151
0 votes
0 answers
140 views

Node level with Stanford dependency parser

I am trying to find a way to select the node(word) level using Stanford dependency parser. But, i haven't found any method that help to get the node level. I will be very grateful for your help
Riadh Belkebir's user avatar
0 votes
0 answers
216 views

Are there grammars for subset of English?

I'm looking for grammar for relatively simple subset of English, tokens in which contain only letters, digits and comma. No quotes, colons, dashes and so on. Is there such thing? If no, is there other ...
DSblizzard's user avatar