Automatic Construction of Multiple Classification Dimensions for Managing Approaches in Scientific Papers

Bing Ma; Hai Zhuge

REVIEW 5 major objections 4 minor 24 references

Automatic Construction of Multiple Classification Dimensions for Managing Approaches in Scientific Papers

T0 review · 5 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Scientific approaches can be indexed by five discourse dimensions so that a query by purpose and technique returns exactly the matching methods.

desk verdict Original extraction and clustering pipeline, but the evaluation is in-sample and the retrieval claim outruns the evidence. read the letter →

arxiv 2505.23252 v2 pith:WWD76K2O submitted 2025-05-29 cs.CL

Bing Ma , Hai Zhuge This is my paper

classification cs.CL

keywords approachextractiondiscourserelationsmulti-dimensionalclassificationclasstreetree-structuresimilarityqueryscientificpapersbottom-upclustering

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that the procedural knowledge inside scientific papers—their approaches—can be extracted, organized, and queried as a multi-dimensional classification space rather than as free text. It identifies five discourse relations that connect the steps of an approach (sequential, purpose-action, action-manner, cause-effect, condition-consequence) and uses them to define extraction patterns refined across semantic, discourse, syntactic, and lexical levels. From these patterns it derives five management dimensions—action, purpose, manner, condition, and effect—and builds a hierarchy of classes on each dimension by clustering approach components with a syntax-tree similarity measure. The intended payoff is that a researcher queries the space by intent, for example with 'summarize news articles' on the purpose dimension and 'feature fusion' on the manner dimension, and receives the approaches that actually satisfy both conditions, with the class-based mechanism shrinking the search space instead of scanning every paper. The work matters because approach retrieval today is keyword search over sentences, which mixes actions, purposes, and techniques into one undifferentiated bag.

What carries the argument

The object that carries the argument is the approach pattern: a grammar-like schema refined top-down through four linguistic levels, starting from five discourse relations inspired by the Penn Discourse Treebank sense hierarchy and ending in explicit lists of lexical identifiers ('firstly', 'in order to', 'by', 'if') tied to syntactic positions such as subject, verb, object, and adverbial. The patterns do double duty: they extract steps from paper text and they place each step's content into the five dimension-specific components. The supporting machinery is a tree-structure-based similarity measure that represents each step component as a syntax tree whose second level holds subject, predicate, object, and adverbial elements, assigns each node a similarity weight that is halved at every level of depth, and scores a pair of trees by the summed weights of their identical or synonymous nodes; a collection similarity measure then matches each step in one approach to its most similar step in another and averages the two directions; and a bottom-up clustering algorithm merges each approach component or class with its most similar counterpart, allowing one approach to belong to several classes while recording shared constituents as class labels. Class trees over these labels form the five dimensions, and a class-based query mechanism walks the trees top-down, keeping only classes whose label match scores beat their parents' scores.

What would settle it

Take a held-out set of scientific papers from disciplines outside the five training topics, for example biology protocols or mathematics proofs, freeze the five relation types and their lexical identifier lists, and count how many approach steps are expressed through discourse relations the paper excludes, such as comparison, concession, or elaboration, or through unlisted connectives. If a substantial share of steps go unextracted, the claim that five relations cover the steps of scientific approaches, and with it the coverage of the purpose, manner, condition, and effect dimensions, fails.

Watch

Extended reading notes

Core claim

The central discovery the paper argues for is that an approach in a scientific paper can be faithfully decomposed into five semantic elements—the action performed, its purpose, the manner or technique used, the condition under which it runs, and the effect it produces—because each element is anchored in a detectable discourse relation between sentences or clauses. On the paper's own terms, an approach is a sequence of steps, each step is one or more sentences, and every step-instantiation falls under one of five discourse relations, so recognizing those relations both extracts the steps and assigns each step's components to the five dimensions. The paper then projects each approach onto each dimension as a collection of step components and builds, per dimension, a tree of classes by repeatedly merging each component or class with its most similar partner, where similarity is computed on tree-structured syntactic representations and class labels record the shared syntactic constituents. The claimed outcome is a multi-dimensional approach space in which exact queries (a string per dimension) and fuzzy natural-language queries both resolve to ranked approach classes, with intersection across dimensions returning only approaches satisfying every specified condition. If this holds, the space is a working index for procedural knowledge, not just a clustering demonstration.

Load-bearing premise

The framework rests on the claim that every step in a scientific approach can be expressed by one of five discourse relations—sequential, purpose-action, action-manner, cause-effect, and condition-consequence—and by the lexical identifiers listed for each, so a step expressed through any other discourse relation or an unlisted identifier falls outside the extraction patterns and the dimension-coverage percentages shrink.

Editorial extensions

If this is right

Approach retrieval becomes intent-based: a researcher can query the purpose and manner dimensions separately and intersect the results, something a keyword search cannot do because it cannot distinguish an action from a purpose.
The class trees provide multiple granularities within each dimension, so a query can match at the level of a specific step (such as 'train neural network') or a general class label (such as 'network'), with ranked approaches inside each retained class.
On the annotated corpus, the action dimension claims to manage 100% of approaches, and the purpose, manner, condition, and effect dimensions claim coverage above 70%, where condition coverage counts each preceding step as the execution condition for the next and effect coverage counts the stated purpose as the realized result.
The class-based query mechanism is claimed to reduce the search space relative to exhaustive scanning, with the paper noting the special case that a query matching no class can take longer because the whole tree must be traversed to confirm the absence of a match.
Approaches clustered together on one dimension can land in different classes on another dimension, so the five dimensions cross-cut rather than duplicate one another; the paper illustrates this with approaches that share an action class but split across purpose classes.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The same four-level refinement could be ported to other genres of procedural text, such as experimental protocols, clinical guidelines, or engineering manuals, where steps are organized by purpose, manner, condition, and effect but rely on different lexical identifiers.
The collection similarity measure could be reused outside retrieval: any task that compares multi-step procedures, such as detecting redundant methods across a literature or organizing methods into a survey, can treat each procedure as a collection of step trees and apply the same matching logic.
A testable extension is whether the tree similarity measure remains stable under paraphrase, for example active versus passive voice or nominalized verbs, since the current evaluation compares steps that largely share the same surface syntax.
The five discourse relations are presented as complete for procedural text, but the top-down refinement machinery could also be applied to relations the paper excludes, such as comparison or concession, to see whether adding them raises recall on steps that currently go unmatched without pulling in non-step sentences.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Short version: this is a real contribution with a serious evaluation gap. The idea—extract multi-step approaches from scientific papers using four-level patterns and organize them into a five-dimensional class tree space—is original and clearly presented. The tree-structure similarity measure for step components is a genuine step beyond common-word and embedding-based comparisons; the worked examples in Tables 7-8 show it captures syntactic structure in a useful way. The clustering algorithm is well-specified, and the complexity analysis is fine. Credit also goes to the authors for honestly discussing the precision-recall trade-off in pattern expansion (Section 2.3.3) and for extending the patterns to pseudocode.

The soft spots are exactly where the reader puts them. The evaluation is in-sample: patterns were refined from examples in the same corpus used to measure them, annotations are self-made with no inter-annotator agreement, and the corpus is not public. So the F1 numbers are really a measure of rule fit. The five-relation taxonomy is asserted to cover all step types, but Section 2.3.3 admits unmatched steps and the fix is to add lexical items; nobody has shown the taxonomy is complete on unseen data. The central retrieval claim ("ensures strong relevance") is supported by a handful of illustrative queries, not a quantitative comparison against keyword or embedding retrieval. The coverage numbers for condition and effect are achieved by counting the previous step as the condition and the purpose as the effect, which is a stretch. There are also small mechanical slips: duplicate reference [10]/[24], and the conclusion's precision 94.31% does not match Table 3's 94.38%.

None of this sinks the core idea. The framework is worth building on, but the paper should be read as a proposal with a proof-of-concept, not a validated system. The right next steps are to release the data, add inter-annotator agreement, evaluate on a held-out corpus, and run a real retrieval baseline. I would send this to review, but with the expectation of major revisions.

Who is it for? Researchers working on scholarly information extraction, discourse parsing for scientific text, and text clustering will want to know about it. I would bring it to a reading group.

Referee Report

5 major / 4 minor

Summary. The paper proposes a pipeline for extracting 'complete approaches' from scientific papers as sequences of steps, using hand-built multi-level pattern grammars organized around five discourse relations (sequential, purpose-action, action-manner, cause-effect, condition-consequence). It then projects each approach onto five dimensions (action, purpose, manner, condition, effect), represents each step component as a syntactic tree, defines a weighted tree-similarity measure and a collection-similarity measure, and clusters approach components into class trees with class labels. Finally, it describes exact and fuzzy query mechanisms over the resulting multi-dimensional approach space. The reported results are extraction F1 values (step-level around 94%, approach-level around 97-98%) on a self-annotated 70-paper corpus, dimension coverage figures, and qualitative query examples on a handful of hand-picked approaches. A pseudocode extension is also sketched in Appendix B.

Significance. If the claims held, the paper would offer a linguistically motivated way to turn procedural text into a structured, queryable resource space, combining discourse-pattern extraction with hierarchical clustering. The pattern grammars are unusually explicit, and the worked examples in Figures 3-7 make the intended semantics readable and the proposed similarity measure very concrete. The small comparison against common-word and SBERT similarity is informative as a motivating illustration. However, the central evaluation is in-sample, the five-relation taxonomy is asserted complete without external evidence, the condition and effect coverage figures are obtained by semantic reinterpretation rather than direct extraction, and the query mechanism is not evaluated at all. These are load-bearing gaps in the evidence for the paper's main claims, not merely presentation issues.

major comments (5)

[§2.3.2, Tables 3–4; §2.3.3] The extraction evaluation is in-sample and therefore overstates generalizability. Section 2.2 states repeatedly that patterns were obtained 'by analyzing examples of steps within this type,' and Section 2.3.3 reports that unmatched steps are repaired by adding lexical items to the same pattern grammar. The corpus is self-built and the annotation procedure in Section 2.3.1 reports no inter-annotator agreement. Moreover, an approach is counted as matched if at least one of its steps matches (Section 2.3.2), which inflates approach-level F1 relative to the step-level numbers. Tables 3 and 4 therefore measure how well the rules fit the annotators' example set, not how well they generalize to unseen papers. Please add a held-out evaluation, report inter-annotator agreement, and report step-level results without the 'at least one step' relaxation.
[§2.1 and §2.3.3] The completeness of the five-relation taxonomy is load-bearing but unvalidated. The grammar <step> ::= ... restricts steps to sequential, purpose-action, action-manner, cause-effect, and condition-consequence relations, and Section 2.1 dismisses other PDTB relations with the assertion that they are 'typically not used to express steps' but provides no corpus evidence. Section 2.3.3 concedes that some steps remain unmatched and that coverage is extended by adding lexical identifiers. Since extraction, dimension coverage, and query behavior all operate only on the subset admitted by these five relations, the abstract and Section 4 claim that querying 'ensures strong relevance' is conditional on an unproven completeness assumption. Please test the taxonomy on held-out papers (e.g., report the proportion of annotated steps that fall outside the five relations and how often unlisted identifiers occur) or explicitly restrict the scope of the claims.
[§3.1, Tables 5–6] The reported coverage of the condition and effect dimensions is not obtained by extraction. Table 5 reports extracted condition coverage of 37.0% and effect coverage of 27.0%; Table 6 raises these to 70.8% and 76.5% by treating the previous step as the execution condition of the next step and by treating the purpose element as the effect when no explicit result is stated. These reinterpretations are a semantic decision made by the authors without validation or a user study, and they change the meaning of the dimension from 'what is explicitly expressed by approach patterns' to 'what can be inferred.' The statement that the condition and effect dimensions are 'able to manage over 70%' of approaches is therefore not supported by the extraction results in Tables 3–4. Please either annotate and evaluate the reinterpreted components directly or present the two sets of coverage figures as distinct claims.
[§4] The central query claim is not evaluated. Section 4 describes exact and fuzzy querying and illustrates it with five hand-picked approaches, but no retrieval experiment is reported: no precision/recall or nDCG against a relevance-judged query set, no comparison with keyword or embedding retrieval, and no measurement of search-space reduction or latency. The phrase 'ensures strong relevance between user queries and results' is therefore a design claim, not an empirical result. In addition, the pruning rule in Step 2 terminates traversal when no direct subclass surpasses the parent's score; because class labels become more specific toward the leaves, a descendant can in principle match a query better than its parent or immediate child, yet the algorithm would miss it. The paper acknowledges information loss at root nodes and patches only that case; it gives no completeness argument for deeper nodes. Please add a retrieval evaluation and either prove the pruning property or soften the search-space claim.
[§3.2.1, Eq. (1)] The similarity measure at the core of clustering and querying relies on an unstated axiom and an undefined notion of synonymy. Equation (1) and the preceding text assume that if two nodes in two step-component trees are 'identical or synonymous,' the subtrees rooted at those nodes are also identical or synonymous; this is not generally true for synonymous phrases and is not argued. The paper also never specifies how synonymy is decided (e.g., WordNet, paraphrases, manual resource), even though the similarity scores, class labels, and query matching all depend on it. Please define the synonymy resource and either prove the subtree assumption for the specific tree representation or replace it with a weaker, defensible matching rule.

minor comments (4)

[Throughout] There are numerous typographical errors (e.g., 'appraoches', 'compoenntes', 'categoried', 'abstracts') and references [10] and [24] are duplicate entries for the same paper; these should be corrected.
[Table 7] The SBERT column is not reproducible without specifying the exact pre-trained model and pooling configuration used; please provide this information or a reference to the exact checkpoint.
[Section 6] The conclusion states that step extraction precision on the full-text dataset is 94.31%, while Table 3 reports 94.38; these numbers should be reconciled.
[Appendix B] The pseudocode extension is not evaluated; if it is kept, it should be presented as a proposal rather than a validated component, or a corresponding evaluation should be reported.

Circularity Check

2 steps flagged · score 6.0 of 10

Pattern rules are fitted on the same self-annotated corpus used to report extraction F1, and the five 'dimensions' are the five discourse-relation patterns renamed, so dimension coverage and extraction verification are partly built in.

fitted input called prediction [Section 2.3.1-2.3.3 (Verification of Approach Pattern)]
"Due to the lack of publicly available datasets for extracting complete appraoches from scientific papers, we collected scientific papers covering various topics and manually annotated approaches. ... This can be addressed by adding specific lexical items into the corresponding lexical-level patterns, thereby expanding the approach patterns so that similar expressions encountered in the future can be successfully matched."

The precision/recall/F1 tables in Section 2.3.2 are computed on this same self-annotated corpus, and Section 2.3.3 describes a fitting loop in which unmatched steps are repaired by adding lexical items to the patterns (e.g., 'This can be addressed by adding specific lexical items into the corresponding lexical-level patterns'). No held-out split or separate test set is described, and no inter-annotator agreement is reported. The reported step recall (93.64% and 93.78%) therefore measures how well the rules were made to cover their own development examples. The extraction 'prediction' is forced by the fitting loop rather than tested on unseen papers.
self definitional [Section 3.1 'Dimensions of Approach', Tables 5 and 6]
"Action is the most fundamental element of a step ... The Action dimension is capable of managing all approaches. ... By treating the previous step in an approach as the execution condition for the subsequent step, the condition dimension is able to manage over 70% of the approaches (as shown in Table 6). ... By treating the purpose element as the actual result for approaches or steps that do not explicitly state a result, the effect dimension is able to manage over 76% of the approaches (as shown in Table 6)."

The five dimensions are 'generalized' from the same five discourse-relation patterns that define what counts as a step, so the coverage counts are computed by the pattern matcher itself. Action's 100% coverage is a definitional consequence of 'most fundamental element of a step', condition's coverage is raised to 70.8% by the definitional rule that the previous step counts as the execution condition, and effect's coverage is raised to 76.5% by counting purpose as the actual result. These are re-descriptions of the pattern definitions, not independent empirical measurements, so they cannot support the claim that the five dimensions manage most approaches.

full rationale

The derivation chain is partly circular. The load-bearing extraction result is evaluated on the same self-annotated corpus used to refine the lexical and syntactic patterns, and Section 2.3.3 explicitly describes the fitting loop in which unmatched steps are repaired by adding lexical items. The reported precision/recall/F1 are therefore in-sample fit statistics rather than held-out predictions; this makes the pattern 'verification' a fitted evaluation. The five dimensions are then obtained by renaming the five discourse-relation patterns into classification axes, and the coverage numbers in Tables 5-6 are definitional: action is 100% by the 'most fundamental element' fiat, condition is boosted by counting the previous step as the condition, and effect by counting purpose as the result. The central 'strong relevance' claim is not itself shown to be circular; it is simply not quantitatively evaluated, since Section 4 provides only illustrative query examples. Self-citations to the authors' prior resource-space and CECW work ([2], [10], [24]) are used for framing or as baselines, not as uniqueness theorems, so they do not add circularity. Overall, the extraction and dimension-coverage claims partially reduce to their own definitions and fitting procedure, while the tree-similarity and clustering algorithms retain independent content, so the paper is partially circular rather than wholly so.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

No new physical, mathematical, or ontological entities are postulated. The multi-dimensional approach space and class trees are data structures and views over existing text; they are not invented entities in the sense of new scientific objects.

free parameters (3)

lexical identifier lists for the five discourse relations = e.g., 'in order to', 'to', 'by', 'through', 'if', 'as long as', 'thereby', 'result in'
Hand-built from a small set of examples per relation (Section 2.2.1-2.2.5). These lists determine which sentences match each discourse relation and hence the extraction precision and recall; they are effectively fitted to the authors' examples, not learned or validated on independent data.
similarity-weight scheme for tree nodes = root weight 1; each child weight = parent weight / number of children
Chosen as a design parameter in Section 3.2.1. It controls how much each matched node contributes to step similarity and therefore shapes all class-tree merges and query rankings; no calibration or comparison to alternative schemes is given.
coverage reinterpretation rules for condition and effect dimensions = previous step treated as condition; purpose treated as effect
Introduced in Section 3.1 to raise dimension coverage from 37% and 27% (Table 5) to 70.8% and 76.5% (Table 6). This is a definitional choice made to make the condition and effect dimensions viable; without it, these dimensions manage less than a third of approaches.

assumptions (4)

domain assumption Five discourse relations (sequential, purpose-action, action-manner, cause-effect, condition-consequence) are sufficient to express every step in scientific approaches.
Section 2.1 defines the pattern space by exactly these five relations and excludes others such as comparison and expansion relations other than manner; if genuine steps are expressed with other relations, they fall outside the extractable set and the dimension coverage claims break.
domain assumption A step's meaning is captured by subject, verb, object, and adverbial slots, and relation identifiers appear only in the slots enumerated in the patterns.
The syntax-level patterns in Section 2.2 restrict each relation's identifiers to particular syntactic positions, for example, purpose identifiers rarely appear in the object slot. This constraint limits recall without independent linguistic evidence.
ad hoc to paper If two nodes in different step trees are identical or synonymous, the subtrees rooted at those nodes are also identical or synonymous.
This rule in Section 3.2.1 justifies excluding subnodes after a match and computing tree similarity from matched nodes' weights; it is an algorithmic assumption that makes the similarity measure tractable but is not proven and can overstate or understate syntactic agreement.
ad hoc to paper Class-based query pruning, where a parent class is deleted when a subclass has a higher matching score, preserves retrieval completeness.
Section 4 Steps 2-3 assumes this pruning keeps the best matches; the paper immediately provides a counterexample, the 'feature fusion' query on the manner dimension, where all root scores are zero and the roots must be removed and subtrees searched, showing the pruning rule is not generally valid and needs patching.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Automatic Construction of Multiple Classification Dimensions for Managing Approaches in Scientific Papers." pith.science (2026). https://pith.science/paper/WWD76K2O

@misc{pith2026250523252,
  author       = {Pith},
  title        = {Pith review of: Automatic Construction of Multiple Classification Dimensions for Managing Approaches in Scientific Papers},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WWD76K2O}},
  note         = {Machine review of arXiv:2505.23252}
}

read the original abstract

Approaches form the foundation for conducting scientific research. Querying approaches from a vast body of scientific papers is extremely time-consuming, and without a well-organized management framework, researchers may face significant challenges in querying and utilizing relevant approaches. Constructing multiple dimensions on approaches and managing them from these dimensions can provide an efficient solution. Firstly, this paper identifies approach patterns using a top-down way, refining the patterns through four distinct linguistic levels: semantic level, discourse level, syntactic level, and lexical level. Approaches in scientific papers are extracted based on approach patterns. Additionally, five dimensions for categorizing approaches are identified using these patterns. This paper proposes using tree structure to represent step and measuring the similarity between different steps with a tree-structure-based similarity measure that focuses on syntactic-level similarities. A collection similarity measure is proposed to compute the similarity between approaches. A bottom-up clustering algorithm is proposed to construct class trees for approach components within each dimension by merging each approach component or class with its most similar approach component or class in each iteration. The class labels generated during the clustering process indicate the common semantics of the step components within the approach components in each class and are used to manage the approaches within the class. The class trees of the five dimensions collectively form a multi-dimensional approach space. The application of approach queries on the multi-dimensional approach space demonstrates that querying within this space ensures strong relevance between user queries and results and rapidly reduces search space through a class-based query mechanism.

Figures

Figures reproduced from arXiv: 2505.23252 by the authors.

**Figure 6.** An example of class trees on the Manner dimension [PITH_FULL_IMAGE:figures/full_fig_p015_6.png] view at source ↗

**Figure 7.** An example of class trees on the Purpose dimension [PITH_FULL_IMAGE:figures/full_fig_p015_7.png] view at source ↗

Figures from the paper (2 more)

**Figure 8.** Figure 8: An example of class trees on the Action dimension after a pruning operation [PITH_FULL_IMAGE:figures/full_fig_p017_8.png]

**Figure 9.** Figure 9: An example of class trees on the Purpose dimension after a pruning operation [PITH_FULL_IMAGE:figures/full_fig_p019_9.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

[24]

Ma, B., & Zhuge, H. (2024). Automatic construction of classifi-cation dimensions by clustering texts based on common words. Expert Systems with Applications, 238, 122292

work page 2024
[1]

Zhuge, H. (2012). The Knowledge Grid - Toward Cyber-Physi-cal Society. World Scientific, (2nd edition)

work page 2012
[2]

Zhuge, H. (2008). The Web Resource Space Model. Springer

work page 2008
[3]

Kovačević, A., Konjović, Z., Milosavljević, B., & Nenadic, G. (2012). Mining methodologies from NLP publications: A case study in automatic terminology recognition. Computer Speech & Language, 26(2), 105-126

work page 2012
[4]

Wang, R., Zhang, C., Zhang, Y., & Zhang, J. (2020). Extracting methodological sentences from unstructured abstracts of aca-demic articles. Sustainable Digital Communities: 15th Interna-tional Conference, iConference 2020, Boras, Sweden, March 23–26, 2020, Proceedings 15 (pp. 790-798). Springer International Publishing

work page 2020
[6]

A Training-free and Reference-free Summarization Evaluation Metric via Centrality-weighted Rel-evance and Self-referenced Redundancy,

W. Chen, P. Li, and I. King, "A Training-free and Reference-free Summarization Evaluation Metric via Centrality-weighted Rel-evance and Self-referenced Redundancy," in Proceedings of the 59th Annual Meeting of the Association for Computational Lin-guistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), ...

work page 2021
[7]

Miltsakaki, E., Prasad, R., Joshi, A., & Webber, B. (2004). The Penn Discourse Treebank. Proceedings of the Fourth Interna-tional Conference on Language Resources and Evaluation (LREC’04)

work page 2004
[8]

Prasad, R., Dinesh, N., Lee, A., Miltsakaki, E., Robaldo, L., Joshi, A., & Webber, B. (2008). The Penn Discourse TreeBank 2.0. In Proceedings of the Sixth International Language Resources and Evaluation (LREC'08) (pp. 2961-2968). European Language Re-sources Association (ELRA)

work page 2008

Show all 24 references

[9]

Webber, B., Prasad, R., Lee, A., & Joshi, A. (2019). The penn dis-course treebank 3.0 annotation manual. Philadelphia, Univer-sity of Pennsylvania, 35,

2019
[11]

Jaccard, P . (1901). Étude comparative de la distribution florale dans une portion des Alpes et des Jura. Bull Soc Vaudoise Sci Nat, 37, 547-579

1901
[12]

Levandowsky, M., & Winter, D. (1971). Distance between sets. Nature, 234(5323), 34-35

1971
[13]

J., & Tanimoto, T

Rogers, D. J., & Tanimoto, T. T. (1960). A Computer Program for Classifying Plants: The computer is programmed to simulate the taxonomic process of comparing each case with every other case. Science, 132(3434), 1115-1118

1960
[14]

Lipkus, A. H. (1999). A proof of the triangle inequality for the Tanimoto distance. Journal of Mathematical Chemistry, 26(1), 263-265

1999
[15]

Salton, G., & Buckley, C. (1988). Term-weighting approaches in automatic text retrieval. Information Processing & Manage-ment, 24(5), 513-523

1988
[16]

Korenius, T., Laurikkala, J., & Juhola, M. (2007). On principal AUTHOR ET AL.: TITLE 23 component analysis, cosine and Euclidean measures in infor-mation retrieval. Information Sciences, 177(22), 4893-4905

2007
[17]

Teufel, S., & Moens, M. (2002). Summarizing scientific articles: experiments with relevance and rhetorical status. Computa-tional linguistics, 28(4), 409-445

2002
[18]

Zhuge, H., & Xing, Y. (2011). Probabilistic resource space model for managing resources in cyber-physical society. IEEE Transac-tions on Services Computing, 5(3), 404–421

2011
[19]

Zhuge, H., Xing, Y., & Shi, P . (2008). Resource space model, OWL and database: Mapping and integration. ACM Transac-tions on Internet Technology, 8(4), 1–31

2008
[20]

Zhuge, H. (2016). Multi-dimensional summarization in cyber-physical society. Morgan Kaufmann

2016
[21]

Zhuge, H. (2020). Cyber-Physical-Social Intelligence. Cyber-Physical-Social Intelligence

2020
[22]

Yu, X., Peng, L., Huang, Z., & Zhuge, H. (2014). A framework for automated construction of resource space based on back-ground knowledge. Future Generation Computer Systems, 32, 222-231

2014
[23]

Zhuge, H. (2008). Communities and emerging semantics in se-mantic link network: Discovery and learning. IEEE Transac-tions on Knowledge and Data Engineering, 21(6), 785-799

2008
[25]

Reimers, N., & Gurevych, I. (2019). Sentence-Bert: Sentence em-beddings using Siamese Bert-networks. In Paper presented at the 2019 Conference on Empirical Methods in Natural Lan-guage Processing and the 9th international joint conference on natural language processing (Pp. 39...

2019
[26]

approach

Aggarwal, C. C., & Zhai, C. (2012). A survey of text clustering algorithms. Chapter 4 in Mining Text Data (pp. 77-128). Springer. APPENDIX A PATTERN OF GENERAL DESCRIPTION The general description summarizes and generalizes the overall process of an approach. Typically, it does...

2012

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.

[1] [24]

Ma, B., & Zhuge, H. (2024). Automatic construction of classifi-cation dimensions by clustering texts based on common words. Expert Systems with Applications, 238, 122292

work page 2024

[2] [1]

Zhuge, H. (2012). The Knowledge Grid - Toward Cyber-Physi-cal Society. World Scientific, (2nd edition)

work page 2012

[3] [2]

Zhuge, H. (2008). The Web Resource Space Model. Springer

work page 2008

[4] [3]

Kovačević, A., Konjović, Z., Milosavljević, B., & Nenadic, G. (2012). Mining methodologies from NLP publications: A case study in automatic terminology recognition. Computer Speech & Language, 26(2), 105-126

work page 2012

[5] [4]

Wang, R., Zhang, C., Zhang, Y., & Zhang, J. (2020). Extracting methodological sentences from unstructured abstracts of aca-demic articles. Sustainable Digital Communities: 15th Interna-tional Conference, iConference 2020, Boras, Sweden, March 23–26, 2020, Proceedings 15 (pp. 790-798). Springer International Publishing

work page 2020

[6] [6]

A Training-free and Reference-free Summarization Evaluation Metric via Centrality-weighted Rel-evance and Self-referenced Redundancy,

W. Chen, P. Li, and I. King, "A Training-free and Reference-free Summarization Evaluation Metric via Centrality-weighted Rel-evance and Self-referenced Redundancy," in Proceedings of the 59th Annual Meeting of the Association for Computational Lin-guistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), ...

work page 2021

[7] [7]

Miltsakaki, E., Prasad, R., Joshi, A., & Webber, B. (2004). The Penn Discourse Treebank. Proceedings of the Fourth Interna-tional Conference on Language Resources and Evaluation (LREC’04)

work page 2004

[8] [8]

Prasad, R., Dinesh, N., Lee, A., Miltsakaki, E., Robaldo, L., Joshi, A., & Webber, B. (2008). The Penn Discourse TreeBank 2.0. In Proceedings of the Sixth International Language Resources and Evaluation (LREC'08) (pp. 2961-2968). European Language Re-sources Association (ELRA)

work page 2008