サクサク読めて、アプリ限定の機能も多数！
トップへ戻る
ブラックフライデー
www.link.cs.cmu.edu
Type your sentence, and hit "Submit" to parse it. Experiment with a new feature of version 4.0--a "phrase-parser" which shows a constituent representation of a sentence. The grammar was created with formal newpaper-style English in mind. Rather than inventing your own sentences, you may wish to "grab" them from other sources. The parser expects just one sentence. It will try to analyze what you pu
A demonstration of top-down splaying Splay trees, or self-adjusting search trees are a simple and efficient data structure for storing an ordered set. The data structure consists of a binary tree, with no additional fields. It allows searching, insertion, deletion, deletemin, deletemax, splitting, joining, and many other operations, all with amortized logarithmic performance. Since the trees adapt
Davy Temperley Daniel Sleator John Lafferty The Link Grammar Parser is a syntactic parser of English, based on link grammar, an original theory of English syntax. Given a sentence, the system assigns to it a syntactic structure, which consists of a set of labeled links connecting pairs of words. The parser also produces a "constituent" representation of a sentence (showing noun phrases, verb
このページを最初にブックマークしてみませんか？
『www.link.cs.cmu.edu』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
