Pipeline Algorithm

A pipeline algorithm is an algorithm that is composed of a series of algorithms.

• AKA: Pipelined Process, Pipeline.
• Context:
  • It can (typically) be used to solve a composite task.
• Example(s):
  • a Supervised Document to Ontology Interlinking Algorithm, such as SDOI Algorithm.
  • an Information Extraction Algorithm, such as TextRunner.
  • …
• Counter-Example(s):
  • a Nonpipelined Algorithm.
• See: Data Stream, Complex Algorithm.

---

---

References

2008

• (Alex et al., 2008) ⇒ Beatrice Alex, Claire Grover, Barry Haddow, Mijail Kabadjov, Ewan Klein, Michael Matthews, Richard Tobin and Xinglong Wang. (2008). “Automating Curation Using a Natural Language Processing Pipeline.” In: Genome Biology 2008, 9(S10). doi:10.1186/gb-2008-9-s2-s10

2007

• (Fundel et al., 2007) ⇒ Katrin Fundel, Robert Kuffner, and Ralf Zimmer. (2007). “RelEx - Relation Extraction Using Dependency Parse Trees.” In: Bioinformatics, 23(3).
  • QUOTE: … As an extension to standard relation extraction pipelines, we propose the use of dependency parse trees

2003

• (Bernadi et al., 2003) ⇒ Raffaella Bernardi, Valentin Jijkoun, Gilad Mishne, and Maarten de Rijke. (2003). “Selectively Using Linguistic Resources Throughout the Question Answering Pipeline.” In: Proceedings of the 2nd CoLogNET-ElsNET Symposium.
  • NOTE: Linguistic Resource

1996

• (Wall et al., 1996) ⇒ Larry Wall, Tom Christiansen, and Randal L. Schwartz. (1996). “Programming Perl, 2nd edition." O'Reilly. ISBN:1565921496
  • pipeline: A series of processes all in a row, linked by pipes, where each passes its output to the next.

---