{"id":"https://openalex.org/W2059293793","doi":"https://doi.org/10.1109/slt.2006.326781","title":"GRAPH-BASED METHODS FOR LANGUAGE PROCESSING AND INFORMATION RETRIEVAL","display_name":"GRAPH-BASED METHODS FOR LANGUAGE PROCESSING AND INFORMATION RETRIEVAL","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2059293793","doi":"https://doi.org/10.1109/slt.2006.326781","mag":"2059293793"},"language":"en","primary_location":{"id":"doi:10.1109/slt.2006.326781","is_oa":false,"landing_page_url":"https://doi.org/10.1109/slt.2006.326781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE Spoken Language Technology Workshop","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081787254","display_name":"Dragomir Radev","orcid":"https://orcid.org/0000-0001-7830-6489"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dragomir Radev","raw_affiliation_strings":["University of Michigan, USA","Michigan University, Ann arbor, MI"],"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Michigan University, Ann arbor, MI","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5081787254"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1015391,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9693999886512756,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9693999886512756,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9369000196456909,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.9150999784469604,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/automatic-summarization","display_name":"Automatic summarization","score":0.8190047144889832},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7966053485870361},{"id":"https://openalex.org/keywords/pagerank","display_name":"PageRank","score":0.7021729946136475},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.6090855598449707},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.5761141777038574},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5485115051269531},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.5231660008430481},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.5159233808517456},{"id":"https://openalex.org/keywords/text-graph","display_name":"Text graph","score":0.5057082176208496},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4950084090232849},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.46095162630081177},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.45405250787734985},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.4210398495197296},{"id":"https://openalex.org/keywords/learning-to-rank","display_name":"Learning to rank","score":0.41801023483276367},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3790075182914734},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.3720017671585083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13258513808250427}],"concepts":[{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.8190047144889832},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7966053485870361},{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.7021729946136475},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6090855598449707},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.5761141777038574},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5485115051269531},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.5231660008430481},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.5159233808517456},{"id":"https://openalex.org/C66945725","wikidata":"https://www.wikidata.org/wiki/Q18388823","display_name":"Text graph","level":3,"score":0.5057082176208496},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4950084090232849},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.46095162630081177},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.45405250787734985},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.4210398495197296},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.41801023483276367},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3790075182914734},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.3720017671585083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13258513808250427},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/slt.2006.326781","is_oa":false,"landing_page_url":"https://doi.org/10.1109/slt.2006.326781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE Spoken Language Technology Workshop","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.8600000143051147,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2996251560","https://openalex.org/W4312905869","https://openalex.org/W2126232808","https://openalex.org/W2986470681","https://openalex.org/W4238363396","https://openalex.org/W2590756584","https://openalex.org/W4385234707","https://openalex.org/W4283069128","https://openalex.org/W3158790061","https://openalex.org/W2359511970"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"A":[4],"number":[5],"of":[6,102,147],"problems":[7,152],"in":[8,24,153],"information":[9,141],"retrieval":[10,142],"and":[11,28,31,48,76,130,143,157],"natural":[12],"language":[13],"processing":[14],"can":[15],"be":[16],"approached":[17],"using":[18,37,54,83,124],"graph":[19,55],"theory.":[20],"Some":[21],"representative":[22],"examples":[23],"IR":[25],"include":[26],"Brin":[27],"Page's":[29],"Pagerank":[30],"Kleinberg's":[32],"HITS":[33],"for":[34,108,127,137,140],"document":[35],"ranking":[36,139],"graph-based":[38,95],"random":[39,113],"walk":[40],"models.":[41],"In":[42,87],"NLP,":[43],"one":[44],"could":[45],"mention":[46],"Pang":[47],"Lee's":[49],"work":[50,59],"on":[51,60,112,115],"sentiment":[52],"analysis":[53],"min-":[56],"cuts,":[57],"Mihalcea's":[58],"word":[61],"sense":[62],"disambiguation,":[63],"Zhu":[64],"et":[65,71,78],"al.'s":[66,72,79],"label":[67],"propagation":[68],"algorithms,":[69],"Toutanova":[70],"prepositional":[73],"attachment":[74],"algorithm,":[75],"McDonald":[77],"dependency":[80],"parsing":[81],"algorithm":[82],"minimum":[84],"spanning":[85],"trees.":[86],"this":[88],"talk":[89],"I":[90],"will":[91],"quickly":[92],"summarize":[93],"three":[94],"algorithms":[96],"developed":[97],"recently":[98],"at":[99],"the":[100,145],"University":[101],"Michigan:":[103],"(a)":[104],"lexrank,":[105,133],"a":[106,121,134],"method":[107,123],"multidocument":[109],"summarization":[110],"based":[111],"walks":[114],"lexical":[116],"centrality":[117],"graphs,":[118],"(b)":[119],"TUMBL,":[120],"generic":[122],"bipartite":[125],"graphs":[126],"semi-supervised":[128,135],"learning,":[129],"(c)":[131],"biased":[132],"technique":[136],"passage":[138],"discuss":[144],"applicability":[146],"such":[148],"techniques":[149],"to":[150],"other":[151],"Natural":[154],"Language":[155],"Processing":[156],"Information":[158],"Retrieval.":[159]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}