在我必须在JAVA中准备的项目中，我有一个这种格式的乳胶文件（它是一个示例部分）
\begin{document}
% typeset front matter
\maketitle \thispagestyle{fancy}
\begin{abstract}
In this paper we present a new architecture of self-routing
switching networks called multi-log$_2\sqrt{N}$. This architecture
was considered by us in several earlier papers. We proved
condition for strict-sense nonblocking and rearrangeable operation
of this switching network. Strict-sense nonblocking
multi-log$_2\sqrt{N}$ switching networks for $N<128$ require less
switching elements than nonblocking multi-log$_2N$ switching
networks proposed by Lea \cite{lea90}. Rearrangeable
multi-log$_2\sqrt{N}$ switching networks for some value of $N$
requires less switching elements than nonblocking multi-log$_2N$
switching networks. In this paper we will consider a performance
of the proposed architecture when a single plane is used (i.e.
blocking one), and compare it with standard log$_{2}N$ switching
networks of the same capacity, as well as with multi-log$_{2}N$
switching networks of the same cost.
\end{abstract}
\section{Introduction}
In future telecommunication networks switches of great capacity
will be needed. This capacity refers to both the total throughput
of a switch and the number of ports served by the switch. When the
number of ports and their bit transfer rate increase, then the
less time a control unit has to determine how to route packets
through a switching network of a switch. Therefore, switching
networks with self-routing capability are particularly attractive
candidates for packet switching in broadband networks. The most
popular architecture of such self-routing switching networks is a
switching network composed of $d\times d$ switches arranged in
log$_{d}N$ stages \cite{lea-multirate-94}. In most popular
solutions $d=2$. An example is a banyan network, other equivalent
architectures, however, like baseline, omega, or perfect shuffle
networks are also well known \cite{Pat98}.
我想创建一个忽略命令的程序，只查找普通单词并将它们存储在不同的文本文件中。我可以使用什么工具？