pencarian buku
buku
Mendukung
Masuk
Masuk
pengguna terdaftar memiliki akses ke:
rekomendasi pribadi
Bot Telegram
riwayat unduhan
mengirim ke alamat email atau Kindle
manajemen daftar buku
penyimpanan ke Favorit
Pribadi
Permintaan untuk buku
Pengkajian
Z-Recommend
Daftar buku
Yang paling populer
Kategori
Partisipasi
Mendukung
Unggahan
Litera Library
Menyumbangkan buku kertas
Menambah buku kertas
Search paper books
LITERA Point saya
Pencarian kata kunci
Main
Pencarian kata kunci
search
1
Parsing Beyond Context-Free Grammars
Springer
Laura Kallmeyer
parsing
node
rcg
grammars
range
items
item
algorithm
trees
input
stack
context
clause
adjunction
different
predicate
first
mcfg
cfg
elementary
clauses
lcfrs
definition
terminals
formalisms
terminal
equivalent
adjoining
earley
predict
substitution
rα
rβ
operation
cyk
scan
nodes
variables
vector
arguments
predicates
argument
consider
automata
concatenation
rcgs
automaton
parser
active
derived
Tahun:
2010
Bahasa:
english
File:
PDF, 1.22 MB
Tag Anda:
5.0
/
0
english, 2010
2
Dependency Structures and Lexicalized Grammars: An Algebraic Approach
Springer-Verlag Berlin Heidelberg
Marco Kuhlmann (auth.)
dependency
structures
node
grammars
projective
degree
context
nodes
projectivity
trees
lemma
figure
parsing
nested
lcfrs
contains
lexicalized
first
generative
algebraic
annotations
ordered
sets
definition
tσ
induced
linearization
terminal
corresponding
capacity
nestedness
traversal
treelet
complexity
generated
finite
edges
formalisms
crossing
function
algorithm
formal
linear
related
defined
edge
strings
interesting
assume
collect
Tahun:
2010
Bahasa:
english
File:
PDF, 1003 KB
Tag Anda:
0
/
0
english, 2010
3
Dependency Structures and Lexicalized Grammars: An Algebraic Approach
Springer-Verlag Berlin Heidelberg
Marco Kuhlmann
dependency
structures
node
grammars
projective
degree
context
nodes
projectivity
trees
lemma
figure
parsing
nested
lcfrs
contains
lexicalized
first
generative
algebraic
annotations
ordered
sets
definition
tσ
induced
linearization
terminal
corresponding
capacity
nestedness
traversal
treelet
complexity
generated
finite
edges
formalisms
crossing
function
algorithm
formal
linear
related
defined
edge
strings
interesting
assume
collect
Tahun:
2010
Bahasa:
english
File:
PDF, 915 KB
Tag Anda:
0
/
0
english, 2010
1
Pindah ke
tautan ini
atau temukan bot "@BotFather" di Telegram
2
Kirimlah perintah /newbot
3
Masukkan nama untuk bot Anda
4
Masukkan nama pengguna untuk bot
5
Salin pesan terbaru dari BotFather dan masukkannya di sini
×
×