Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with dependency-grammar
Search options not deleted
user 2451
Dependency grammar, often abbreviated as DG, is a particular approach to the syntax of natural languages. DGs view words as directly linked to each other, whereby the links are directed. Phrases consist of a head/root word and its dependents.
2
votes
Computational model of dependency parsing
Dependency parsing is constraint solving. I recommend you have a look at XDG, which is the only formally precise dependency grammar approach I'm aware of.
- 2,600
1
vote
Accepted
How do surface and deep syntax differ in dependency grammars?
There are two main differences:
Deep syntax structures are dags,
Only content words serve as nodes there.
The idea is that deep syntax structures should be as language independent as possible. In …
- 2,600
1
vote
Do formal language theory have concepts corresponding to dependency grammars?
What you are asking about is called abstract syntax tree (AST) in the theory of formal languages. Consider a simple grammar for arithmetic expressions and the following input string: 2/(3-4). It has t …
- 2,600
1
vote
How can one best formalize dependency structures in terms of rules?
If one wants to show that a theory of syntax is plausible, it's necessary to implement it in such a way that well-formed sentences are accepted (and assigned a sensible syntactic structure) and ill-fo …
- 2,600
1
vote
Accepted
What it the best algorithm for dependency parsing?
Dependency parsing with ID/LP rules is trivial if you have a lexicon. One uses a (declarative) generate-and-test approach. Dependency trees are rooted spanning trees on a graph with n nodes where n is …
- 2,600
2
votes
Where can I find a good primer of dependency grammar?
This book is good though quite old: The Meaning of the Sentence in its Semantic and Pragmatic Aspects
Geert-Jan Kruijff gave a nice course at ESSLLI: DG, and you can google up his papers on DG.
XDG …
- 2,600
0
votes
What constitutes a Long Distance Dependency, and how can it be quantified?
You could count the nonprojective dependencies in a sentence. This is actually a very nice definition of long-distance (unbounded) dependencies. The degree of nonprojectivity also gives you a measure …
- 2,600
3
votes
Accepted
Steps to build a dependency parser
I suppose you mean a rule-based parser since nobody would think of developing his own statistical parser (there are so many good open-source libraries).
Building a parser is quite complicated. The be …
- 2,600
1
vote
How do dependency grammars account for information structure
One can't account for information structure at the level of surface syntax. Consider the sentence илсьірбоит (I'm showing it to her; Abkhaz). It has three topical arguments (only topics can be pro-dro …
- 2,600
0
votes
Accepted
Dependency tree with "seem"
In surface syntax it's "John - seemed". In deep syntax it depends on the theory. "John" would depend on "fall" but sometimes there are two heads and one would say that the subject of "seem" is athemat …
- 2,600
3
votes
X-bar theory without movement
You might want to have a look at LFG, they use X' Theory extended with an additional "lexocentric" category S to accommodate nonconfigurational phrase structures.
- 2,600
0
votes
Accepted
Monoclausality in dependency trees
Clausal arity can't be expressed structurally at the surface level. I'll modify the Catalan example (I'll use llegir "to read") and add two more phrases:
(1) faig llegir - complex predicate (CP), mon …
- 2,600
1
vote
German Dependency Parsing - question about dependencies between "sich ____ lassen"
Your intuition is correct, the parser is wrong in this case. Note that the argument structure for "lassen" taking an open complement is lassen⟨_,_,P⟨...⟩⟩ where P is the secondary predicator. This mea …
- 2,600
0
votes
Accepted
How do formal theories analyse the syntax of polysynthetic languages?
Polysynthetic languages do almost all the work in the lexicon so a better question would be how they deal with morphology. There's a formal grammar for Georgian and Abkhaz developed by Paul Meurer. He …
- 2,600
1
vote
Why is the subject outside the VP in most theories of syntax?
Let me first note that the shape of syntactic structures isn't affected by semantic constraints. As for the structural position of the subject, note that there's the so-called VP-internal subject hypo …
- 2,600