After proving, in a purely categorial way, that the inclusion functor InAlg(Σ) from Alg(Σ), the category of many-sorted Σ-algebras, to PAlg(Σ), the category of many-sorted partial Σ-algebras, has a left adjoint FΣ, the (absolutely) free completion functor, we recall, in connection with the functor FΣ, the generalized recursion theorem of Schmidt, which we will also call the Schmidt construction. Next we define a category Cmpl(Σ), of Σ-completions, and prove that FΣ, labeled with its domain category and the unit of the adjunction of which it is a part, is a weakly initial object in it. Following this we associate to an ordered pair (α,f), where α=(K,γ,α) is a morphism of Σ-completions from F=(C,F,η) to G=(D,G,ρ) and f a homomorphism in D from the partial Σ-algebra A to the partial Σ-algebra B, a homomorphism ΥαG,0(f):Schα(f)B. We then prove that there exists an endofunctor, ΥαG,0, of Mortw(D), the twisted morphism category of D, thus showing the naturalness of the previous construction. Afterwards we prove that, for every Σ-completion G=(D,G,ρ), there exists a functor ΥG from the comma category (Cmpl(Σ)↓G) to End(Mortw(D)), the category of endofunctors of Mortw(D), such that ΥG,0, the object mapping of ΥG, sends a morphism of Σ-completion in Cmpl(Σ) with codomain G, to the endofunctor ΥαG,0.

The human-readable simplicity with which the CSV format was devised, together with the absence of a standard that strictly defines this format, has allowed the proliferation of several variants in the dialects with which these files are written. The latter has meant that the exchange of information between data management systems, or between countries and regions, requires human intervention during the data mining and cleansing process. This has led to the development of various computational tools that aim to accurately determine the dialects of CSV files, in order to avoid data loss at data loading stage in a given system. However, the dialect detection is a complex problem and current systems have limitations or make assumptions that need to be improved and/or extended. This paper proposes a method for determining CSV file dialects through table uniformity, a statistical approach based on table consistency and records dispersion measurement along with the detection of data type over each field. The new method has a 100\% accuracy on a dataset with 148 CSV files composed of samples coming from a data load testing framework and some others added as verification of the parsing routines. In tests on truly messy data, the proposed solution outperforms the state-of-the-art tool by achieving an improvement of about 10\% in the accuracy with which dialects are detected. Furthermore, the proposed method is accurate enough to determine dialects by reading only ten records, requiring more data to disambiguate those cases where the first records do not contain the necessary information to conclude with a dialect determination.