A Statistical Method for Acquiring Knowledge about the Abbreviation Possibility of Some of Multiple Adnominal Phrases(Special Issue on Text Processing for Information Access)
スポンサーリンク
概要
- 論文の詳細を見る
This paper proposes a statistical method of acquiring knowledge about the abbreviation possibility of some of multiple adnominal phrases. Our method calculates weight values of multiple adnominal phrases by mutual information based on the strength of relation between the adnominal phrases and modified nouns. Among adnominal phrases, those having relatively low weight values are deleted. The evaluation of our method by experiments shows that precision attains about 84.1% and recall attains about 59.2%, respectively.
- 社団法人電子情報通信学会の論文
- 2003-09-01
著者
-
Masuyama Shigeru
Department Of Knowledge-based Information Engineering Toyohashi University Of Technology
-
Masuyama Shigeru
Department Of Applied Mathematics And Physics Faculty Of Engineering Kyoto University
-
Sakai Hiroyuki
Department Of Knowledge-based Information Engineering Toyohashi University Of Technology
-
Sakai Hiroyuki
Department Of Agricultural Chemistry Faculty Of Agriculture Niigata University
関連論文
- A New Aspect of the Carotid Body Function Controlling Hypoxic Ventilatory Decline in Humans
- A case of allergic contact dermatitis due to hydrocortisone butyrate propionate
- A Verrucous Lesion on Skin Grafted after Necrotizing Fasciitis in a Diabetic Patient Successfully Treated with Combined Topical 5-FU and Tacalcitol
- Satisfactory Remission Achieved by PUVA Therapy in Langerhans Cell Hisiocytosis in an Elderly Patient
- Chronic tophaceous gout secondary to self-induced vomiting in anorexia nervosa
- An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs
- An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph
- Dose-Dependent Enhancing Effects of Unfractionated Heparin on Shear-Induced von Willebrand Factor-Mediated Platelet Aggregation (Thrombosis/Thrombolysis 1 (IHD), The 69th Annual Scientific Meeting of the Japanese Circulation Society)
- Cause Information Extraction from Financial Articles Concerning Business Performance
- Estimation of Tangential Velocity near Side Wall of Fully Turbulent Agitated Vessel without Baffles
- A Case of Sezary Syndrome Associated with Cutaneous Transformation
- Peristomal pyoderma gangrenosum associated with rectal adenocarcinoma
- Control of Upper Airway Function in Response to Hypoxia in Patients with Obstructive Sleep Apnea Syndrome
- Compensatory Excretion of Prostacyclin and Thromboxane Metabolites in Obstructive Sleep Apnea Syndrome
- The Effect of Changing Rate of PIO_2 Fall on Relationship between Ventilatory and Heart Rate Response to Progressive Hypoxia
- Analysis of Heart Rate Profile during Obstructive Sleep Apnea
- Properties on the Average Number of Spanning Trees in Connected Spanning Subgraphs for an Undirected Graph
- Formulas for Counting the Numbers of Connected Spanning Subgraphs with at Most n+1 Edges in a Complete Graph K_n
- PROPASAL OF THE UNRESTRICTED LR(k) GRAMMAR AND ITS PARSER
- Infinitesimal deformation of Galois covering space and its application to Galois closure curves
- Oxidation of Short-chain iso-Alkanes by Gaseous Hydrocarbon Assimilating Mold, Scedosporium sp. A-4(Microbiology & Fermentation Industry)
- A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs(Invited Papers from New Horizons in Computing)
- Molybdenum Cluster Halide Compound Mo_6Cl_(OH_2)_2 with Six-Handed Linkage Hydrogen Bonding
- An Informative DOM Subtree Identification Method from Web Pages in Unfamiliar Web Sites
- Formulation of Mobile Agent Allocation and Its Strong NP-Completeness(Complexity Theory)
- Multiple Document Summarization System GOLD(Special Issue on Text Processing for Information Access)
- UGLR Parser for Phrase Structure Languages as an Extension of GLR Parser (Special Section on Discrete Mathematics and Its Applications)
- T1 MINIMUM VERTEX RANKING SPANNING TREE PROBLEM : A TUTORIAL(Tutorial speech)
- A Parallel Algorithm for Finding All Hinge Vertices of an Interval Graph
- A Statistical Method for Acquiring Knowledge about the Abbreviation Possibility of Some of Multiple Adnominal Phrases(Special Issue on Text Processing for Information Access)
- A Simple Near Optimal Parallel Algorithm for Recognizing Outerplanar Graphs
- An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs
- MINIMUM DELAY SEMIJOIN SCHEDULES FOR LOCAL AREA DISTRIBUTED DATABASE SYSTEMS(Mathematical Theories on Computing Schemes and Their Applications)
- Assigning Polarity to Causal Information in Financial Articles on Business Performance of Companies
- An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs
- On the Largest Common Subgraph Problem
- An Algorithm for Minimum Feedback Vertex Set Problem on a Trapezoid Graph
- Automatic Construction of Train Arrival and Departure Schedules at Terminal Stations
- Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs
- A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs
- 4A3 AN ONLINE SCHEDULING ALGORITHM THAT MINIMIZES THE TOTAL COMPLETION TIME IN AN AGV SYSTEM AND ITS COMPETITIVE ANALYSIS(Technical session 4A: Material handling system)
- 5A2 AUTOMATIC CONSTRUCTION OF TRAIN ARRIVAL AND DEPARTURE SCHEDULES IN TERMINAL STATIONS(Technical session 5A: OS4: Railway scheduling)